A note on polling models with renewal arrivals and nonzero switch-over times
نویسندگان
چکیده
We consider polling systems with general service times and switch-over times, gated service at all queues and with general renewal arrival processes. We derive closed-form expressions for the expected delay in heavy-traffic (HT). So far, rigorous proofs of HT limits have only been obtained for Poisson-type arrival processes, whereas for renewal arrivals HT limits are based on conjectures [5, 6, 8].
منابع مشابه
A new method for deriving waiting-time approximations in polling systems with renewal arrivals
We study the waiting-time distributions in cyclic polling models with renewal arrivals, general service and switch-over times, and exhaustive service at each of the queues. The assumption of renewal arrivals prohibits an exact analysis and reduces the available analytic results to heavy-traffic asymptotics, limiting results for large switch-over times and large numbers of queues, and some numer...
متن کاملPolling models with renewal arrivals: A new method to derive heavy-traffic asymptotics
We consider asymmetric cyclic polling systems with an arbitrary number of queues, general service-time distributions, zero switch-over times, gated service at each queue, and with general renewal arrival processes at each of the queues. For this classical model, we propose a new method to derive closed-form expressions for the expected delay at each of the queues when the load tends to 1, under...
متن کاملEvaluation and optimization of polling systems
Throughout this internship report, polling systems play a central role. Polling systems are queueing systems consisting of multiple queues, attended by a single server. The server can only serve one queue at a time. Whenever the server moves from one queue to another, a stochastic, non-zero switch-over time is incurred. The server never idles; even when there are no customers waiting in the who...
متن کاملClosed-Form Waiting Time Approximations for Polling Systems
A typical polling system consists of a number of queues, attended by a single server in a fixed order. The vast majority of papers on polling systems focusses on Poisson arrivals, whereas very few results are available for general arrivals. The current study is the first one presenting simple closed-form approximations for the mean waiting times in polling systems with renewal arrival processes...
متن کاملPolling systems with periodic server routing in heavy traffic: renewal arrivals
This paper considers heavy-traffic limit theorems for polling models with periodic server routing with general renewal arrivals and with mixtures of gated and exhaustive service policies, in a general parameter setting. We provide a strong conjecture for the limiting waiting-time distribution in a general parameter setting when the load tends to 1, under proper heavy-traffic scalings. The resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 36 شماره
صفحات -
تاریخ انتشار 2008